A strengthened Orlicz–Pettis theorem via Itô–Nisio
نویسندگان
چکیده
Abstract In this note, we deduce a strengthening of the Orlicz–Pettis theorem from Itô–Nisio theorem. The argument shows that given any series in Banach space which is not summable (or more generally unconditionally summable), can construct (coarse-grained) subseries with property that—under some appropriate notion “almost all”—almost all further thereof fail to be weakly summable. Moreover, by Hoffmann–Jørgensen allows us replace ‘weakly summable’ ‘ $$\tau$$ τ -weakly for topologies weaker than weak topology. A treatment admissible given.
منابع مشابه
Strengthened Stone-weierstrass Type Theorem
The aim of the paper is to prove that if L is a linear subspace of the space C(K) of all real-valued continuous functions defined on a nonempty compact Hausdorff space K such that min(|f |, 1) ∈ L whenever f ∈ L, then for any nonzero g ∈ L̄ (where L̄ denotes the uniform closure of L in C(K)) and for any sequence (bn)n=1 of positive numbers satisfying the relation P∞ n=1 bn = ‖g‖ there exists a se...
متن کاملStrengthened Brooks' Theorem for Digraphs of Girth at least Three
Brooks’ Theorem states that a connected graph G of maximum degree ∆ has chromatic number at most ∆, unless G is an odd cycle or a complete graph. A result of Johansson shows that if G is triangle-free, then the chromatic number drops to O(∆/ log∆). In this paper, we derive a weak analog for the chromatic number of digraphs. We show that every (loopless) digraph D without directed cycles of leng...
متن کاملOn Tychonoff's type theorem via grills
Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces, and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$. We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ related to these grills, and present a simple proof to this theorem. This immediately yields the classical theorem...
متن کاملStrengthened Brooks Theorem for digraphs of girth three
Brooks’ Theorem states that a connected graph G of maximum degree ∆ has chromatic number at most ∆, unless G is an odd cycle or a complete graph. A result of Johansson [6] shows that if G is triangle-free, then the chromatic number drops to O(∆/ log ∆). In this paper, we derive a weak analog for the chromatic number of digraphs. We show that every (loopless) digraph D without directed cycles of...
متن کاملPick's Theorem via Minkowski's Theorem
ACKNOWLEDGMENTS This note was inspired by Brian Davies, who challenged Nick Trefethen at Oxford by pointing out that the evaluation of the integral (7) would cause serious difficulties both analytically and numerically. One of the authors (T.S.) had the pleasure of attending Trefethen’s course in Oxford, where problems like Davies’s had to be solved on a weekly basis. Discussing the integral wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Functional Analysis
سال: 2023
ISSN: ['2639-7390', '2008-8752']
DOI: https://doi.org/10.1007/s43034-022-00225-1